Automatically Refining Abstract Interpretations
نویسندگان
چکیده
Abstract interpretation techniques prove properties of programs by computing abstract fixpoints. All such analyses suffer from the possibility of false errors. We present three techniques to automatically refine such abstract interpretations to reduce false errors: (1) a new operator called interpolated widen, which automatically recovers precision lost due to widen, (2) a new way to handle disjunctions that arise due to refinement, and (3) a new refinement algorithm, which refines abstract interpretations that use the join operator to merge abstract states at join points. We have implemented our techniques in a tool Dagger. Our experimental results show our techniques are effective and that their combination is even more effective than any one of them in isolation. We also show that Dagger is able to prove properties of C programs that are beyond current abstraction-refinement tools, such as Slam [4], Blast [14], Armc [18], and our earlier tool [11].
منابع مشابه
Grammar Analysis and Parsing by Abstract Interpretation
We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars akin to pushdown automata. The result is a hierarchy of bottom-up or top-down semantics refining the classical equational and derivational language semantics and including Knuth grammar problem, classical grammar flow analysis algorithms...
متن کاملGrammar semantics, analysis and parsing by abstract interpretation
We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars akin to pushdown automata. The result is a hierarchy of bottom-up or top-down semantics refining the classical equational and derivational language semantics and including Knuth grammar problems, classical grammar flow analysis algorithm...
متن کاملGeneralized Strong Preservation by Abstract Interpretation
Many algorithms have been proposed for reducing the state space of a Kripke structure in order to obtain a minimal abstract structure that strongly preserves a given temporal specification language. These are partition refinement algorithms, namely they work on standard abstract models which are partitions of the state space States . In an abstract interpretation-based view, we show that state ...
متن کاملStatic Analysis of Digital Filters
We present an Abstract Interpretation-based framework for automatically analyzing programs containing digital filters. Our framework allows refining existing analyses so that they can handle given classes of digital filters. We only have to design a class of symbolic properties that describe the invariants throughout filter iterations, and to describe how these properties are transformed by fil...
متن کاملEFFECT OF REFINING PROCESS ON POROSITY AND MECHANICAL PROPERTIES OF HIGH PRESSURE AL-SI ALLOY DIE CASTINGS
Abstract: This study presents the research results of effect that refining process has on porosity and mechanical properties of high pressure die castings made of AlSi12S alloy. The operation of refining was carried out in a melting furnace with the use of an FDU Mini Degasser. Mechanical properties (UTS, YS, Elongation, Brinell Hardness) were assessed on samples taken from high pressure die ca...
متن کامل